Weight Functions and theExtension Theorem for Linear

نویسنده

  • Jay A. Wood
چکیده

An extension theorem for general weight functions is proved over nite chain rings. The structure of the complex semigroup ring associated to the multiplicative semigroup of the ring plays a prominent role in the proof. 1. Background In her doctoral dissertation, MacWilliams 7], 8] proved an equivalence theorem: two linear codes C 1 ; C 2 F n deened over a nite eld F are equivalent up to monomial transformations if and only if there is a linear isomorphism f : C 1 ! C 2 which preserves Hamming weight. Bogart, Goldberg, and Gordon 2] gave another proof of this theorem, and a character theoretic proof was provided by Ward and the author 13]. Following up on the ideas in 13], the author has extended the character the-oretic techniques to linear codes deened over nite Frobenius rings, rst for the Hamming weight 15] and then for symmetrized weight compositions 16]. In this paper, the author treats general weight functions deened over nite chain rings, i.e., nite commutative local principal ideal rings. Goldberg proved the extension theorem for symmetrized weight compositions over nite elds, 5], and Constan-tinescu, Heise, and Honold have proved an extension theorem for homogeneous weight functions over Z=m, 4]. A word on the name of the theorem. MacWilliams' result above is sometimes referred to as \the equivalence theorem of MacWilliams." I have come to prefer This paper is in nal form and no version of it will be submitted for publication elsewhere. c 0000 (copyright holder)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

Generalization of Titchmarsh's Theorem for the Dunkl Transform

Using a generalized spherical mean operator, we obtain a generalization of Titchmarsh's theorem for the Dunkl transform for functions satisfying the ('; p)-Dunkl Lipschitz condition in the space Lp(Rd;wl(x)dx), 1 < p 6 2, where wl is a weight function invariant under the action of an associated re ection group.

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

The method of radial basis functions for the solution of nonlinear Fredholm integral equations system.

In this paper, An effective and simple numerical method is proposed for solving systems of integral equations using radial basis functions (RBFs). We present an algorithm based on interpolation by radial basis functions including multiquadratics (MQs), using Legendre-Gauss-Lobatto nodes and weights. Also a theorem is proved for convergence of the algorithm. Some numerical examples are presented...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999